On Structures of Inverted Index for Query Processing Efficiency

نویسندگان

  • Xingshen Song
  • Xueping Zhang
  • Yuexiang Yang
  • Jicheng Quan
  • Kun Jiang
چکیده

Efficiency On Structures of Inverted Index for Query Processing Efficiency . . . . . . . . . 3 Xingshen Song, Xueping Zhang, Yuexiang Yang, Jicheng Quan, and Kun Jiang Access Time Tradeoffs in Archive Compression . . . . . . . . . . . . . . . . . . . . . 15 Matthias Petri, Alistair Moffat, P.C. Nagesh, and Anthony Wirth Large Scale Sentiment Analysis with Locality Sensitive BitHash. . . . . . . . . . 29 Wenhao Zhang, Jianqiu Ji, Jun Zhu, Hua Xu, and Bo Zhang

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Skips for Faster Postings List Intersection

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

متن کامل

Improved Skips for Faster Postings List Intersection

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...

متن کامل

Efficiency and effectiveness of query processing in cluster-based retrieval

Our research shows that for large databases, without considerable additional storage overhead, cluster-based retrieval (CBR) can compete with the time efficiency and effectiveness of the inverted index-based full search (FS). The proposed CBR method employs a storage structure that blends the cluster membership information into the inverted file posting lists. This approach significantly reduce...

متن کامل

Distributed Query Processing Using Partitioned Inverted Files

In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The distributed system adopts a network of workstations model and the client-server paradigm. The document collection is indexed with an inverted file. We adopt two distinct strategies of index partitioning in the distribute...

متن کامل

Performance of Inverted Indices in Shared - Nothing

The performance of distributed text document retrieval systems is strongly innuenced by the organization of the inverted index. This paper compares the performance impact on query processing of various physical organizations for inverted lists. We present a new prob-abilistic model of the database and queries. Simulation experiments determine which variables most strongly in-uence response time...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015